lp-norms of codewords from capacity- and dispersion-achieveing Gaussian codes

نویسنده

  • Yury Polyanskiy
چکیده

It is demonstrated that codewords of good codes for the additive white Gaussian noise (AWGN) channel become more and more isotropically distributed (in the sense of evaluating quadratic forms) and resemble white Gaussian noise (in the sense of lp norms) as the code approaches closer to the fundamental limits. In particular, it is shown that the optimal Gaussian code must necessarily have peak-to-average power ratio (PAPR) of order log n.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Looping linear programming decoding of LDPC codes

Considering the Linear Programming (LP) decoding of Low-Density-Parity-Check (LDPC) code [1], we describe an efficient algorithm for finding pseudo codewords with the smallest effective distance. The algorithm, coined LP-loop, starts from choosing randomly initial configuration of the noise. The configuration is modified through a discrete number of steps. Each step consists of two sub-steps. F...

متن کامل

Sparse Superposition Codes: Fast and Reliable at Rates Approaching Capacity with Gaussian Noise

For the additive white Gaussian noise channel with average codeword power constraint, sparse superposition codes are developed. Both encoding and decoding are computationally feasible. The codewords are linear combinations of subsets of vectors from a given dictionary, with the possible messages indexed by the choice of subset. An adaptive successive decoder is developed, with which communicati...

متن کامل

An Improved Analysis of Least Squares Superposition Codes with Bernoulli Dictionary

For the additive white Gaussian noise channel with average power constraint, sparse superposition codes, proposed by Barron and Joseph in 2010, achieve the capacity. While the codewords of the original sparse superposition codes are made with a dictionary matrix drawn from a Gaussian distribution, we consider the case that it is drawn from a Bernoulli distribution. We show an improved upper bou...

متن کامل

The Optimal Density of Infinite Constellations for the Gaussian Channel

The setting of a Gaussian channel without power constraints is considered. In this setting the codewords are points in an n-dimensional Euclidean space (an infinite constellation). The channel coding analog of the number of codewords is the density of the constellation points, and the analog of the communication rate is the normalized log density (NLD). The highest achievable NLD with vanishing...

متن کامل

ar X iv : c s / 06 06 05 1 v 1 [ cs . I T ] 1 2 Ju n 20 06 Minimum Pseudo - Weight and Minimum Pseudo - Codewords of LDPC Codes ∗

In this correspondence, we study the minimum pseudo-weight and minimum pseudo-codewords of low-density parity-check (LDPC) codes under linear programming (LP) decoding. First, we show that the lower bound of Kelly, Sridhara, Xu and Rosenthal on the pseudo-weight of a pseudo-codeword of an LDPC code with girth greater than 4 is tight if and only if this pseudo-codeword is a real multiple of a co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012